Close

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier8JMKD3MGPAW/3PFS8RS
Repositorysid.inpe.br/sibgrapi/2017/08.22.02.28
Last Update2017:08.22.02.28.20 (UTC) administrator
Metadata Repositorysid.inpe.br/sibgrapi/2017/08.22.02.28.20
Metadata Last Update2022:06.14.00.09.03 (UTC) administrator
DOI10.1109/SIBGRAPI.2017.8
Citation KeyCondori:2017:ExDiIm
TitleExtending the Differential Image Foresting Transform to Root-based Path-cost Functions with Application to Superpixel Segmentation
FormatOn-line
Year2017
Access Date2024, Apr. 27
Number of Files1
Size1587 KiB
2. Context
AuthorCondori, Marcos Ademir Tejada
AffiliationUniversity of Sao Paulo, Institute of Mathematics and Statistics, Sao Paulo, SP, Brazil
EditorTorchelsen, Rafael Piccin
Nascimento, Erickson Rangel do
Panozzo, Daniele
Liu, Zicheng
Farias, Mylène
Viera, Thales
Sacht, Leonardo
Ferreira, Nivan
Comba, João Luiz Dihl
Hirata, Nina
Schiavon Porto, Marcelo
Vital, Creto
Pagot, Christian Azambuja
Petronetto, Fabiano
Clua, Esteban
Cardeal, Flávio
e-Mail Addressmarcostejadac@gmail.com
Conference NameConference on Graphics, Patterns and Images, 30 (SIBGRAPI)
Conference LocationNiterói, RJ, Brazil
Date17-20 Oct. 2017
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Book TitleProceedings
Tertiary TypeFull Paper
History (UTC)2017-08-22 02:28:20 :: marcostejadac@gmail.com -> administrator ::
2022-06-14 00:09:03 :: administrator -> :: 2017
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
KeywordsImage Foresting Transform
Superpixels
Differential Image Foresting Transform
IFT-SLIC
AbstractThe Image Foresting Transform (IFT) is a general framework to develop image processing tools for a variety of tasks such as image segmentation, boundary tracking, morphological filters, pixel clustering, among others. The Differential Image Foresting Transform (DIFT) comes in handy for scenarios where multiple iterations of IFT over the same image with small modifications on the input parameters are expected, reducing the processing complexity from linear to sublinear with respect to the number of pixels. In this paper, we propose an enhanced variant of the DIFT algorithm that avoids inconsistencies, when the connectivity function is not monotonically incremental. Our algorithm works with the classical and non-classifical connectivity functions based on root position. Experiments were conducted on a superpixel task, showing a significant improvement to a state-of-the-art method.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 2017 > Extending the Differential...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > Extending the Differential...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Content
agreement.html 21/08/2017 23:28 1.2 KiB 
4. Conditions of access and use
data URLhttp://urlib.net/ibi/8JMKD3MGPAW/3PFS8RS
zipped data URLhttp://urlib.net/zip/8JMKD3MGPAW/3PFS8RS
Languageen
Target Filecondori148.pdf
User Groupmarcostejadac@gmail.com
Visibilityshown
Update Permissionnot transferred
5. Allied materials
Mirror Repositorysid.inpe.br/banon/2001/03.30.15.38.24
Next Higher Units8JMKD3MGPAW/3PKCC58
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2017/09.12.13.04 5
sid.inpe.br/banon/2001/03.30.15.38.24 2
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
Empty Fieldsarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close